Simultaneous Replacement in Normal Programs

Simultaneous Replacement in Normal Programs

The simultaneous replacement transformation operation ii here denned and studied w.r.t normal programs. We giveapplicability conditions able to ensure the correctness of the operation w.r.t. the set of logical consequences of thecompleted database. We consider separately the cases in which the underlying language is infinite and finite; in thislatter case we also distinguish accordi...

Centrum Voor Wiskunde En Informatica Reportrapport Simultaneous Replacement in Normal Programs Simultaneous Replacement in Normal Programs

The simultaneous replacement transformation operation, is here deened and studied wrt normal programs. We give applicability conditions able to ensure the correctness of the operation wrt the set of logical consequences of the completed database. We consider separately the cases in which the underlying language is innnite and nite; in this latter case we also distinguish according to the kind o...

Transforming Normal Programs by Replacement

The replacement transformation operation, already defined in [28], is studied wrt normal programs. We give applicability conditions able to ensure the correctness of the operation wrt Fitting's and Kunen's semantics. We show how replacement can mimic other transformation operations such as thinning, fattening and folding, thus producing applicability conditions for them too. Furthermore we char...

Disjunctive Logic Programs versus Normal Logic Programs

This paper focuses on the expressive power of disjunctive and normal logic programs under the stable model semantics over finite, infinite, or arbitrary structures. A translation from disjunctive logic programs into normal logic programs is proposed and then proved to be sound over infinite structures. The equivalence of expressive power of two kinds of logic programs over arbitrary structures ...

Representing Normal Programs with Clauses